Qualitative Spatial Reasoning Using Constraint Calculi

نویسندگان

  • Jochen Renz
  • Bernhard Nebel
چکیده

1. Introduction Qualitative reasoning is an approach for dealing with commonsense knowledge without using numerical computation. Instead, one tries to represent knowledge using a limited vocabulary such as qualitative relationships between entities or qualitative categories of numerical values, for instance, using {+, −, 0} for representing real values. An important motivation for using a qualitative approach is that it is considered to be closer to how humans represent and reason about commonsense knowledge. Another motivation is that it is possible to deal with incomplete knowledge. Qualitative reasoning, however, is different from fuzzy computation. While fuzzy categories are approximations to real values, qualitative categories make only as many distinctions as necessary—the granularity depends on the corresponding application. Two very important concepts of commonsense knowledge are time and space. Time, being a scalar entity, is very well suited for a qualitative approach and, thus, qualitative temporal reasoning has early emerged as a lively sub-field of qualitative reasoning which has generated a lot of research effort and important results. Space, in turn, is much more com

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning

In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property of almost all of these calculi is that reasoning in them can be understood as solving a binary constraint satisfaction problem over infinite domains. The main algorithmic method that is used is constraint propagation ...

متن کامل

GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi

GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and (heuristic) backtracking. In contrast to specialized reasoners, it offers reasoning services for different qualitative calculi, which means that these calcul...

متن کامل

Including Qualitative Spatial Knowledge in the Sense-Plan-Act Loop

In this paper we present ongoing work on integrating qualitative and metric spatial reasoning into planning for robots. We propose a knowledge representation and reasoning technique, grounded on well-established constraint-based spatial calculi, for combining qualitative and metric knowledge and obtaining plans expressed in actionable metric terms.

متن کامل

Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning

Qualitative Spatial and Temporal Reasoning (QSR) is concerned with constraint-based formalisms for representing, and reasoning with, spatial and temporal information over infinite domains. Within the QSR community it has been a widely accepted assumption that genuine qualitative reasoning methods outperform other reasoning methods that are applicable to encodings of qualitative CSP instances. R...

متن کامل

SparQ - A Spatial Reasoning Toolbox

SparQ is a toolbox for qualitative spatial reasoning. Interpreting reasoning in a broad sense, SparQ covers mapping information from quantitative to qualitative, applying constraint reasoning to qualitative information, reasoning about calculi, and mapping qualitative information back to the quantitative domain. The toolbox is designed for extensibility and released under the GNU GPL public lic...

متن کامل

A Categorical Perspective on Qualitative Constraint Calculi

In the domain of qualitative constraint reasoning, a subfield of AI which has evolved in the last 25 years, a large number of calculi for efficient reasoning about space and time has been developed. Reasoning problems in such calculi are usually formulated as constraint satisfaction problems. For temporal and spatial reasoning, these problems often have infinite domains, which need to be abstra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007